منابع مشابه
Games with Limited Communication Structure
In this paper we consider cooperative transferable utility games with limited communication structure, called graph games. Agents are able to cooperate with each other only if they can communicate directly or indirectly with each other. For the class of acyclic graph games recently the average tree solution has been proposed. It was proven that the average tree solution is a core element if the...
متن کاملSecurity Games with Limited Surveillance
Randomized first-mover strategies of Stackelberg games are used in several deployed applications to allocate limited resources for the protection of critical infrastructure. Stackelberg games model the fact that a strategic attacker can surveil and exploit the defender’s strategy, and randomization guards against the worst effects by making the defender less predictable. In accordance with the ...
متن کاملTwo-step values for games with two-level communication structure
TU games with two-level communication structure, in which a two-level communication structure relates fundamentally to the given coalition structure and consists of a communication graph on the collection of the a priori unions in the coalition structure, as well as a collection of communication graphs within each union, are considered. For such games we introduce two families of two-step value...
متن کاملwo-step values for games with two-level communication structure
TU games with two-level communication structure, in which a two-level communication structure relates fundamentally to the given coalition structure and consists of a communication graph on the collection of the a priori unions in the coalition structure, as well as a collection of communication graphs within each union, are considered. For such games we introduce two families of two-step value...
متن کاملThe average tree solution for cooperative games with communication structure
We study cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class of games. Given the graph structure we define a collection of spanning trees, where each spanning tree specifies a particular way by whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2007
ISSN: 1556-5068
DOI: 10.2139/ssrn.987780